Clustering Evolving Networks
نویسندگان
چکیده
Roughly speaking, clustering evolving networks aims at detecting structurally dense subgroups in networks that evolve over time. This implies that the subgroups we seek for also evolve, which results in many additional tasks compared to clustering static networks. We discuss these additional tasks and difficulties resulting thereof and present an overview on current approaches to solve these problems. We focus on clustering approaches in online scenarios, i.e., approaches that incrementally use structural information from previous time steps in order to incorporate temporal smoothness or to achieve low running time. Moreover, we describe a collection of real world networks and generators for synthetic data that are often used for evaluation.
منابع مشابه
Improving Community Detection in Time-Evolving Networks Through Clustering Fusion
Traditional community detection algorithms are easily interfered by noises and outliers. Therefore, we propose to leverage a clustering fusion method to improve the results of community detection. Usually, there are two issues in clustering ensembles: how to generate efficient diversified cluster members, and how to ensembles the results of all members. Specifically: (1) considering the time ev...
متن کاملLocal-world evolving networks with tunable clustering
We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree distribution, clustering coefficient and average path length. Our model can unify the generic properties of real-life networks: scale-free degree distribution, high ...
متن کاملModel-Based Clustering of Time-Evolving Networks through Temporal Exponential-Family Random Graph Models
Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving networks. However, due to significant computational challenges and difficulties in modeling communities of time-evolving ...
متن کاملExperimental Evaluation of Dynamic Graph Clustering Algorithms
Graph clustering is concerned with identifying the group structure of networks. Existing static methods, however, are not the best choice for evolving networks with evolving group structures. We discuss dynamic versions of existing clustering algorithms which maintain and modify a clustering over time rather than recompute it from scratch. We developed an extensible software framework for the e...
متن کامل